-
1 recursion method
Математика: рекуррентный метод -
2 recursion method
-
3 method
метод; процедура; способ- antithetic variate method - average ordinate method - average range method - binary search method - conjugate directions method - conjugate gradient method - control chart method - conventional milling method - correlation function method - decision function method - differential control method - Feynman diagram method - first approximation method - gradient projection method - iterative method - large sample method - large sieve method - least-squares regression method - less than fully efficient method - linearly implicit method - method of adjoint gradient - method of algebraic addition - method of alternating directions - method of balanced blocks - method of complex numbers - method of confidence intervals - method of conformal mappings - method of conjugate directions - method of conjugate gradients - method of cyclic descent - method of detached coefficients - method of disjunction of cases - method of divided differences - method of electrical images - method of elimination of quantifiers - method of empty ball - method of extreme values - method of false position - method of feasible directions - method of finite differences - method of first approximation - method of first entrance - method of fitting constants - method of fixed points - method of full enumeration - method of generating functions - method of geometric exhaustion - method of indefinite coefficients - method of infinite descent - method of interval bisection - method of least absolute values - method of least distance - method of least likelihood - method of maximum likelihood - method of means and standard deviations - method of medians and extreme values - method of minimal change - method of minimal variance - method of mirror reflections - method of moving frame - method of multiple comparison - method of orthogonal projections - method of paired associates - method of paired comparisons - method of phase integrals - method of projecting cones - method of proportional parts - method of rotating factors - method of semantic tableaux - method of separation of variables - method of simulaneous displacements - method of stationary phase - method of statistical differentials - method of statistical inference - method of steep variations - method of steepest ascent - method of stochastic approximation - method of straightforward iteration - method of successive displacements - method of successive divisions - method of successive elimination - method of transfinite induction - method of unweighted means - method of variable differences - method of variation of parameters - method of weighted residuals - optimum method - parallel tangents method - precision method - random walk method - recursive method - reduced gradient method - reflected wave method - relative method of measurement - sampling method by variables - statistical sampling method - steepest descent method - time average method -
4 self-recursion
в ООП - возможность объекта отправлять сообщения самому себе, т. е. вызывать собственные методы.Syn:Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > self-recursion
-
5 formula
1. n формулаthey sought a formula that would allow settling of the dispute — они искали формулировку для разрешения спора
2. n рецепт3. n молочная смесь; детская смесь4. n догмат5. n шаблон, стереотипformula paintings — стандартные, шаблонные картины
6. n формула или классСинонимический ряд:1. established mode of speech (noun) code; credo; creed; custom; established mode of speech; protocol; ritual; ritualized speech; rote2. exact method (noun) blueprint; description; direction; exact method; guidelines; method; prescription; specifications3. symbolic representation (noun) chemical formula; empirical formula; equation; graphic formula; logarithm; ratio; recipe; symbolic representation; theorem -
6 transfinite
трансфинитный large transfinite dimension ≈ топ. большая трансфинитная размерность method of transfinite induction ≈ метод трансфинитной индукции principle of transfinite induction ≈ принцип трансфинитной индукции transfinite central series ≈ трансфинитный центральный ряд transfinite p-adic line ≈ трансфинитная p-адическая прямая - transfinite algorithm - transfinite automaton - transfinite cardinal - transfinite closure - transfinite diameter - transfinite dimension - transfinite formula - transfinite function - transfinite hierarchy - transfinite induction - transfinite number - transfinite order - transfinite ordinal - transfinite product - transfinite recursion - transfinite sequence бесконечный, безграничныйБольшой англо-русский и русско-английский словарь > transfinite
См. также в других словарях:
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… … Wikipedia
Recursion — Recursion, in mathematics and computer science, is a method of defining functions in which the function being defined is applied within its own definition. The term is also used more generally to describe a process of repeating objects in a self… … Wikipedia
recursion — rɪ kÉœrÊ’n / kÉœËʃn n. programming method in which a routine or function rereads itself several times until a specific condition is met (Computers) … English contemporary dictionary
Tail recursion — In computer science, tail recursion (or tail end recursion) is a special case of recursion in which the last operation of the function is a recursive call. Such recursions can be easily transformed to iterations. Replacing recursion with… … Wikipedia
Left recursion — In computer science, left recursion is a special case of recursion. In terms of context free grammar, a non terminal r is left recursive if the left most symbol in any of r’s ‘alternatives’ either immediately (direct left recursive) or through… … Wikipedia
Course-of-values recursion — In computability theory, course of values recursion is a technique for defining number theoretic functions by recursion. In a definition of a function f by course of values recursion, the value of f(n+1) is computed from the sequence . The fact… … Wikipedia
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Levinson recursion — or Levinson Durbin recursion is a procedure in linear algebra to recursively calculate the solution to an equation involving a Toeplitz matrix. The algorithm runs in Θ(n2) time, which is a strong improvement over Gauss Jordan elimination, which… … Wikipedia
Scientific method — … Wikipedia
Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… … Wikipedia